- mod n transform
- преобразование по mod n (по модулю числа n)
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
mod n transform
Смотреть что такое "mod n transform" в других словарях:
Number-theoretic transform — The number theoretic transform (NTT) is similar to the discrete Fourier transform, but operates with modular arithmetic on integers instead of complex numbers.DefinitionThe discrete Fourier transform is given by:f j=sum {k=0}^{n 1}x kleft(e^{… … Wikipedia
Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… … Wikipedia
com|mod|i|fy — «kuh MOD uh fy», transitive verb. to transform something into an article or source of commerce: »the attempt to commodify the experience of grieving into an industry supporting texts, workshops and educational seminars … Useful english dictionary
Key-to-Address Transform Techniques — In der Informatik bezeichnet man eine spezielle Indexstruktur als Hashtabelle (englisch hash table oder hash map) bzw. Streuwerttabelle. Hashtabellen eignen sich vor allem dazu, Datenelemente in einer großen Datenmenge aufzufinden. Hashtabellen… … Deutsch Wikipedia
Schönhage-Strassen algorithm — The Schönhage Strassen algorithm is an asymptotically fast multiplication algorithm for large integers. It was developed by Arnold Schönhage and Volker Strassen in 1971. [A. Schönhage and V. Strassen, Schnelle Multiplikation großer Zahlen ,… … Wikipedia
Cyclic code — In coding theory, cyclic codes are linear block error correcting codes that have convenient algebraic structures for efficient error detection and correction. Contents 1 Definition 2 Algebraic structure 3 Examples … Wikipedia
Trigonometry in Galois fields — In mathematics, the theory of quadratic extensions of finite fields supports analogies with trigonometry.The main motivation to deal with a finite field trigonometry is the power of the discrete transforms, which play an important role in… … Wikipedia
Shor's algorithm — Shor s algorithm, first introduced by mathematician Peter Shor, is a quantum algorithm for integer factorization. On a quantum computer, to factor an integer N, Shor s algorithm takes polynomial time in log{N}, specifically O((log{N})^3),… … Wikipedia
P-adic quantum mechanics — One may compute the energy levels for a potential well like this one.[note 1] P adic quantum mechanics is a relatively recent approach to understanding the nature of fundamental physics. It is the application of p adic analysis to quantum… … Wikipedia
Kloosterman sum — In mathematics, a Kloosterman sum is a particular kind of exponential sum. Let a , b , m be natural numbers. Then :K(a,b;m)=sum {0leq xleq m 1, gcd(x,m)=1 } e^{2pi i (ax+bx^*)/m},Here x* is the inverse of x modulo m . They are named for the Dutch … Wikipedia
Merkle–Hellman knapsack cryptosystem — The Merkle–Hellman knapsack cryptosystem was one of the earliest public key cryptosystems invented by Ralph Merkle and Martin Hellman in 1978.[1] Although its ideas are elegant, and far simpler than RSA, it has been broken.[2] Contents 1… … Wikipedia
